strongly connected graph

This article analysises the strongly connexity of accessible matrices, it also gives a new approach to identify strongly connected graph from digraph.

文中用可达矩阵分析了有向图的强连通性，并给出了一种判别有向图为强连通图的新方法。

Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.

可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。

The reachability matrix of directed graph plays a very important role on identifying whether a directed graph to be strongly connected or not and calculating the strongly connected sub graph.

图的可达性矩阵在判断图的强连通性以及求强连通分图中具有重要作用。